Uni-directional links in routing
نویسنده
چکیده
A number of network configurations, in which pairs of nodes are connected by uni-directional links (UDLs), is increasing. For the QoS related reasons, it may be also advantageous to assume that a bi-directional link (BDL) is a set of two unidirectional links. Current routing protocols are designed for networks where all links are bi-directional. They fail to perform in networks with UDLs therefore new routing schemes are needed. In this paper, several routing solutions for networks with UDLs are overviewed, focusing on the uni-cast routing.
منابع مشابه
Uni-directional Alternating Group Graphs
A class of uni-directional Cayley graphs based on alternating groups is proposed in this paper. It is shown that this class of graphs is strongly connected and recursively scalable. The analysis of the shortest distance between any pair of nodes in a graph of this class is also given. Based on the analysis, we develop a polynomial time routing algorithm which yields a path distance at most one ...
متن کاملAn Accurate Model for the Performance Analysis of Deterministic Wormhole Routing
We present a new analytical approach for the performance evaluation of asynchronous wormhole routing in k-ary n-cubes. Through the analysis of network flows, our methodology furnishes a closed formula for the average message delay in wormhole deterministic routing. In this paper, the focus is on 30 asymmetric torus networks with uni-directional or bi-directional links. However, the model can be...
متن کاملAn Extended Fault-Tolerant Link-State Routing Protocol in the Internet
Link state routing protocols such as OSPF and IS IS are widely used in the Internet today In link state routing protocols global network topology information is rst collected at each node A shortest path tree SPT is then constructed by applying the Dijkstra s shortest path algorithm at each node Link state protocols usually require the ooding of new information to the entire sub network after c...
متن کاملAn Extended Fault - Tolerant Link - State Routing Protocol in the Internet 1
Link-state routing protocols, such as OSPF and IS-IS, are widely used in the Internet today. In link-state routing protocols, global network topology information is first collected at each node. A shortest path tree (SPT) is then constructed by applying the Dijkstra’s shortest path algorithm at each node. Link-state protocols usually require the flooding of new information to the entire (sub)ne...
متن کاملForward-only uni-directional routing
Wireless computer networks have properties that differ significantly from traditional wireline networks. One prominent difference is the presence of unidirectional channels. That is, it may be possible for a computer p to send a message to a neighboring computer q, but it may not be possible for computer q to send a message to computer p. This introduces significant changes in routing protocols...
متن کامل